منابع مشابه
Solis Graphs and Uniquely Metric Basis Graphs
A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...
متن کاملStress Wave Propagation in Elastic-elastic and Elastic-viscoelastic Bilaminates
In the present study normal plate-impact experiments are conducted to investigate the propagation of acceleration waves in 2-D layered material systems. The objective of these experiments is to understand the role of material architecture and material inelasticity in controlling precursor decay and late-time dispersion of acceleration waves in elastic-elastic and elasticviscoelastic laminates. ...
متن کامل[Elastic].
Since the ventricular myocardium is made up of a band of myocardial fibres which are configured into a complicated three-dimensional helical way, some time spent handling and observing this teaching model can help any cardiologist involved in imaging methods to understand and interpret the structural basis of the motion patterns of the heart. We concede that we need the cooperation of all disci...
متن کاملElastic SIEM: Elastic Detector integrated with OSSIM
This paper introduces a new approach to overcome new threats and attacks which arise with the adoption of cloud computing. Traditional security solutions are not suitable for this new elastic and dynamic scenario. This paper shows a solution to protect cloud users against side-channel attacks by taking advantage of the integration of OSSIM with Elastic Detector.
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Forum of Mathematics, Sigma
سال: 2019
ISSN: 2050-5094
DOI: 10.1017/fms.2019.4